Model Checking Temporal Logic Formulas Using Sticker Automata

Model Checking Temporal Logic Formulas Using Sticker Automata

As an important complex problem, the temporal logic model checking problem is still far from being fully resolved under the circumstance of DNA computing, especially Computation Tree Logic (CTL), Interval Temporal Logic (ITL), and Projection Temporal Logic (PTL), because there is still a lack of approaches for DNA model checking. To address this challenge, a model checking method is proposed fo...

Model Checking Computational Tree Logic Using Sticker Automata

The molecular computing has been successfully employed to solve more and more complex computation problems. However, as an important complex problem, the Computational Tree Logic (CTL) model checking is still far from resolved under the circumstance of molecular computing, since it is still a lack of method. To address this issue, an autonomous model checking method is presented for checking al...

Model Checking Temporal-Epistemic Logic Using Tree Automata

We introduce an automata-theoretic approach for the verification of multi-agent systems. We present a translation between branching time temporal-epistemic logic and alternating tree automata. Model checking an interpreted system against a temporal-epistemic formula is reduced to checking the non-emptiness of the composition of two tree automata. We exemplify this technique using a simple multi...

Model Checking Temporal-Epistemic Logic Using Alternating Tree Automata

We introduce a novel automata-theoretic approach for the verification of multi-agent systems. We present epistemic alternating tree automata, an extension of alternating tree automata, and use them to represent specifications in the temporal-epistemic logic CTLK. We show that model checking a memory-less interpreted system against a CTLK property can be reduced to checking the language non-empt...

Model Checking Metric Temporal Logic over Automata with One Counter